User Classification Based On Mouse Dynamic Authentication Using K-Nearest Neighbor

نویسندگان

چکیده

Mouse dynamics authentication is a method for identifying person by analyzing the unique pattern or rhythm of their mouse movement. Owing to its distinctive properties, such movements can be used as basis security. The development technology followed urge keep private data safe from hackers. Therefore, increasing accuracy user classification and reducing false acceptance rate (FAR) are necessary improve In this study, we propose combine K-nearest neighbor simple random sampling obtain sample dataset users attackers. results show that our proposed has high implement practical system reports best than previous research with FAR 0.037. implemented in real login system. rejection will not problem because most important thing denying attacker access.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

K-Nearest Neighbor Classification Using Anatomized Data

This paper analyzes k nearest neighbor classification with training data anonymized using anatomy. Anatomy preserves all data values, but introduces uncertainty in the mapping between identifying and sensitive values. We first study the theoretical effect of the anatomized training data on the k nearest neighbor error rate bounds, nearest neighbor convergence rate, and Bayesian error. We then v...

متن کامل

Performance of the K Nearest Neighbor in Keyboard Dynamic Authentication

Securing personal information and combating impersonation are nowadays considered as national priorities. Biometrics, the physical traits and behavioral characteristics that make each of us unique, promises an effective solution to our security needs. It is the aim of this paper to explore the use of the K nearest neighbor as a cheap and an unobtrusive way of reinforcing the de facto security m...

متن کامل

k-Nearest Neighbor Classification on Spatial Data

Classification of spatial data streams is crucial, since the training dataset changes often. Building a new classifier each time can be very costly with most techniques. In this situation, k-nearest neighbor (KNN) classification is a very good choice, since no residual classifier needs to be built ahead of time. KNN is extremely simple to implement and lends itself to a wide variety of variatio...

متن کامل

On Nearest Neighbor Classification Using Adaptive Choice of k

Nearest neighbor classification is one of the simplest and popular methods for statistical pattern recognition. It classifies an observation x to the class, which is the most frequent in the neighborhood of x. The size of this neighborhood is usually determined by a predefined parameter k. Normally, one uses cross-validation techniques to estimate the optimum value of this parameter, and that e...

متن کامل

Weighted K-Nearest Neighbor Classification Algorithm Based on Genetic Algorithm

K-Nearest Neighbor (KNN) is one of the most popular algorithms for data classification. Many researchers have found that the KNN algorithm accomplishes very good performance in their experiments on different datasets. The traditional KNN text classification algorithm has limitations: calculation complexity, the performance is solely dependent on the training set, and so on. To overcome these li...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Makara journal of technology

سال: 2023

ISSN: ['2355-2786', '2356-4539']

DOI: https://doi.org/10.7454/mst.v27i1.1557